Elliptic Curve Public-Key Cryptosystem Over Z(i)
نویسنده
چکیده
A method to implement elliptic curve public-key cryptosystem over Z(i) is discussed. The method is in fact the same as the technique that works on Galois fields but here works on Z(i). The curve under Z(i) generates more points as compared to the curve under Galois fields. The security of the system is better due to more number of points on the curve. But there are some difficulties in the new system and through this paper; we try to discuss some of the pitfalls of the new system. KeywordsElliptic Curve Cryptography, ECDLP, Gaussian Integer, Unique Factorization Domain.
منابع مشابه
Equivalence of Counting the Number of Points on Elliptic Curve over the Ring Zn and Factoring n
1 I n t r o d u c t i o n Elliptic curves can be applied to public-key cryptosystems, and as such several schemes have been proposed [3, 4, 5, 6, 9, 11]. There are two typical elliptic curve cryptosystems: E1Gamal-type scheme [4, 11] and RSA-type schemes [3, 5, 6]. The security of the EIGamal-type elliptic curve cryptosystem is based on the difficulty of solving a discrete logarithm over ellipt...
متن کاملA Public Key Cryptosystem Based on Elliptic Curves over Z/nZ Equivalent to Factoring
Elliptic curves over the ring Z / n Z where R is the product of two large primes have first been proposed for public key cryptosystems in [4]. The security of this system is based on the integer factorization problem, but it is unknown whether breaking the system is equivalent to factoring. In this paper, we present a variant of this cryptosystem for which breaking the system is equivalent to f...
متن کاملSecurity and E ciency Analyses of Public Key Cryptosystems
This thesis analyzes the security and e ciency of public key cryptosystems. New attacks for several cryptosystems are proposed and the e ectiveness of the attacks is evaluated. Furthermore, solutions are given to several unsolved problems in computational number theory and algebraic geometry theory that are closely related to the security of public key cryptosystems. Moreover, new calculation m...
متن کاملPublic-Key Cryptosystem Based on Isogenies
A new general mathematical problem, suitable for publickey cryptosystems, is proposed: morphism computation in a category of Abelian groups. In connection with elliptic curves over finite fields, the problem becomes the following: compute an isogeny (an algebraic homomorphism) between the elliptic curves given. The problem seems to be hard for solving with a quantum computer. ElGamal public-key...
متن کاملA NEW PROTOCOL MODEL FOR VERIFICATION OF PAYMENT ORDER INFORMATION INTEGRITY IN ONLINE E-PAYMENT SYSTEM USING ELLIPTIC CURVE DIFFIE-HELLMAN KEY AGREEMENT PROTOCOL
Two parties that conduct a business transaction through the internet do not see each other personally nor do they exchange any document neither any money hand-to-hand currency. Electronic payment is a way by which the two parties transfer the money through the internet. Therefore integrity of payment and order information of online purchase is an important concern. With online purchase the cust...
متن کامل